Simple Proofs of Characterizing Strong Normalization for Explicit Substitution Calculi
نویسنده
چکیده
We present a method of lifting to explicit substitution calculi some characterizations of the strongly normalizing terms of λ-calculus by means of intersection type systems. The method is first illustrated by applying to a composition-free calculus of explicit substitutions, yielding a simpler proof than the previous one by Lengrand et al. Then we present a new intersection type system in the style of sequent calculus, and show that it characterizes the strongly normalizing terms of Dyckhoff and Urban’s extension of Herbelin’s explicit substitution calculus.
منابع مشابه
From to a Journey through Calculi of Explicit Substitutions
This paper gives a systematic description of several calculi of explicit substitutions. These systems are orthogonal and have easy proofs of termination of their substitution calculus. The last system, called , entails a very simple environment machine for strong normalization of-terms.
متن کاملPerpetuality for Full and Safe Composition (in a Constructive Setting)
We study perpetuality in calculi with explicit substitutions having full composition. A simple perpetual strategy is used to define strongly normalising terms inductively. This gives a simple argument to show preservation of β-strong normalisation as well as strong normalisation for typed terms. Particularly, the strong normalisation proof is based on implicit substitution rather than explicit ...
متن کاملFormalising Strong Normalisation Proofs of the Explicit Substitution Calculi in Alf
Explicit substitution calculi have become very fashionable in the last decade. The reason is that substitution calculi bridge theory and implementation and enable control over evaluation steps and strategies. Of the most important questions of explicit substitution calculi is that of the termination of the underlying calculus of substitution (without-reduction rule). For this reason, one nds wi...
متن کاملCalculi of Generalized beta-Reduction and Explicit Substitutions: The Type-Free and Simply Typed Versions
Extending the λ-calculus with either explicit substitution or generalized reduction has been the subject of extensive research recently, and still has many open problems. This paper is the first investigation into the properties of a calculus combining both generalized reduction and explicit substitutions. We present a calculus, λgs, that combines a calculus of explicit substitution, λs, and a ...
متن کاملStrong Normalization of Explicit Substitutions via Cut Elimination in Proof Nets
In this paper, we show the correspondence existing between normalization in calculi with explicit substitution and cut elimination in sequent calculus for Linear Logic,via Proof Nets. This correspondence allows us to prove that a typed version of the λx-calculus [34, 5] is strongly normalizing, as well as of all the calculi that can be translated to it keeping normalization properties such as λ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007